Location:
Search - huffman coding
Search list
Description: 问题描述]
利用哈夫曼编码进行信息通信可以大大提高信道利用率，缩短信息传输时间，降低传输成本。但是，这要求在发送端通过一个编码系统对待传数据预先编码，在接收端将传来的数据进行译码（复原）。对于双工信道（即可以双向传输信息的信道），每端都需要一个完整的编/译码系统。试为这样的信息收发站写一个哈夫曼编/译码系统。-Description of the problem] use Huffman encoding of information and communication can greatly improve the channel utilization, reduce the information transmission time, lower transmission costs. However, this requires the sending end through a coding system for pre-treatment of mass data encoding, will be heard at the receiving end of the data decoding (recovery). For duplex channel (ie, two-way transmission of information can be channel), each client requires a full encoder/decoder system. Test for such information transceiver station to write a Huffman encoder/decoder system.
Platform: |
Size: 15360 |
Author: yangyang |
Hits:
Description: 一份huff_tc.c，只能在tc下运行，因为加入了用tc图形界面直观画出树形的代码。一份是huff_vc.c,是在vc和tc下都能运行的程序，没有直观表达编码的树形结构。
[目的]
构建所输入符号（及权值）的哈夫曼树，并利用该树求出各符号的编码，深入理解最优二叉树的概念及其特性。
[问题描述]
读入各个符号及其权值，求各符号的哈夫曼编码。
[基本要求]
（1）读入各个符号及其权值，建立哈夫曼树；
（2）利用建立的哈夫曼树对各符号进行编码，输出编码结果。
[选做内容]
将所建立的哈夫曼树以直观的方式（树或凹入形式的表）显示。
-huff_tc.c, can only run at tc, because using the add tc intuitive graphical interface to draw tree code [Objective] To construct the input symbols (and the right value) of the Huffman tree, and use the tree to derive the coded symbols, in-depth understanding of the concept of optimal binary tree and its characteristics. [Problem Description] read into the various symbols and their weights, and Huffman coding of the symbols. [Basic requirements] (1) read into the various symbols and their weights, Huffman tree set up (2) the use of the Huffman tree for the set up of the symbol encoding, output encoding results. [Does the content of the election] will be set up by the Huffman tree to intuitive way (tree or indentations in the form of the table) shows.
Platform: |
Size: 3072 |
Author: 李霄逍 |
Hits:
Description: 摘 要
文章以空间监控系统为背景,深入研究了JPEG图像压缩标准的实现方法,并基于FPGA对其进行了实现和优化。文中给出了详细的实现方法和优化过程,测试表明达到了很好的效果。
简单介绍了有损静态图像压缩当前有两种比较流行的标准JPEG和JPEG2000。说明了用JPEG方法压缩的原因。
介绍JPEG基本原理：JPEG对灰度图像的压缩处理过程主要包括:图像分割,离散余弦变换(DCT),量化(Quantization),“Z”形排序(Zigzag Scan),差分脉冲编码调制(Differential Pulse Code Modulation,DPCM)对直流系数(DC),行程长度编码(Run-Length Encoding,RLE)对交流系数(AC),霍夫曼(Huffman)编码等。
JPEG标准的特点是离散余弦变换。
比较详细介绍压缩系统的构成和实现。实现提及步骤， JPEG压缩模块设计和编码模块实现细节。
-Abstract
Article in the space monitoring system for the background, in-depth study of the JPEG image compression standard implementation methods and carried out based on FPGA implementation and optimization. In this paper, a detailed method of implementation and optimization of the process, testing showed that to achieve good results.
Easy introduction of harmful static image compression has two kinds of comparisons that the current popular standard JPEG and JPEG2000. Illustrated by the reasons for JPEG compression method.
JPEG introduce the basic principles: JPEG compression of gray-scale image processing include: image segmentation, discrete cosine transform (DCT), quantization (Quantization), "Z"-shaped sort (Zigzag Scan), differential pulse code modulation (Differential Pulse Code Modulation, DPCM) on the DC coefficient (DC), Run Length Encoding (Run-Length Encoding, RLE) of the exchange coefficient (AC), Hoffman (Huffman) coding.
JPEG standard is characterized by discrete
Platform: |
Size: 523264 |
Author: 压子 |
Hits:
Description: matlab环境下利用huffman编码实现图像无损压缩和文本的压缩-matlab environment implementation using huffman coding image lossless compression and text compression
Platform: |
Size: 15360 |
Author: jj |
Hits:
Description: ) Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
-) Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
Platform: |
Size: 1024 |
Author: ria |
Hits:
Description: Huffman Coding & Decoding for Text Compression
Platform: |
Size: 59392 |
Author: Saranya |
Hits:
Description: 数据压缩，c语言，huffman编码，vc实现-Data compression, c language, huffman coding
Platform: |
Size: 13312 |
Author: dyg |
Hits:
Description: Matlab下实现huffman编码 在MATLAB中模拟c中链表 利用复数运算-Matlab under huffman coding in the MATLAB simulation of c in the list in the use of the plural operation
Platform: |
Size: 155648 |
Author: peng |
Hits:
Description: 关于哈夫曼编码的8种不同的方法，让我们一起研究研究~-Huffman coding on the eight kinds of different ways, let us take a look ~
Platform: |
Size: 616448 |
Author: 瑞文 |
Hits:
Description: 一种huffman编码，可以快速算出图片的编码结果-A huffman coding, can quickly calculate the results of image coding
Platform: |
Size: 1024 |
Author: 孙晓峰 |
Hits:
Description: 编码教常用的哈弗曼编码的MATLAB仿真的源程序-MATLAB source to huffman coding
Platform: |
Size: 1024 |
Author: 张军政 |
Hits:
Description: Adaptive-Huffman Coding自适应的Huffman压缩与解压缩。
在压缩与解压缩过程中动态地改变Huffman树，和编码。-Adaptive-Huffman Coding Adaptive Huffman compression and decompression. Compression and decompression in the process of changing the dynamic Huffman tree, and coding.
Platform: |
Size: 2028544 |
Author: star |
Hits:
Description: 赫夫曼实现编码译码C++环境下运行！
-Huffman coding to achieve coding
Platform: |
Size: 267264 |
Author: sunshengsan |
Hits:
Description: 利用霍夫曼编码算法对数字图像进行压缩及解压缩处理，解压出来的图像与源图像几乎完全一致，峰值信噪比为无穷大-The use of Huffman coding algorithm for digital image compression and decompression processing, extracting images from the source image is almost exactly the same infinite PSNR
Platform: |
Size: 168960 |
Author: tianjieyu |
Hits:
Description: 数据结构课程设计——霍夫曼编码（含有设计要求，需求分析，源代码）-Data Structure Course Design- Huffman coding (with the design requirements, requirements analysis, source code)
Platform: |
Size: 417792 |
Author: liu jian |
Hits:
Description: 哈弗曼编码的C语言实现，自己编的，很实用，很容易看懂，希望对大家理解哈弗曼编码有所帮助-Havermann coded C language implementation, compiled their own, very practical, very easy to understand, want to help everyone understand the Havermann coding
Platform: |
Size: 145408 |
Author: 王晋 |
Hits:
Description: 对MATLAB软件中已经存在的Shannon.txt文档进行霍夫曼编码，检测霍夫曼编码的编码速率。-On the MATLAB software that already exists Shannon.txt documents Huffman coding, the encoding rate of detection of Huffman coding.
Platform: |
Size: 7168 |
Author: 史锁兰 |
Hits:
Description: 用MATLAB进行编程实现对256*256图像进行的哈夫曼编码-Carried out using MATLAB image Huffman coding
Platform: |
Size: 1024 |
Author: 张凤 |
Hits:
Description: Codes".
Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called "prefix-free codes") (that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol) that expresses the most common characters using shorter strings of bits than are used for less common source symbols. Huffman was able to design the most efficient compression method of this type: no other mapping of individual source symbols to unique strings of bits will produce a smaller average output size when the actual symbol frequencies agree with those used to create the code. A method was later found to do this in linear time if input probabilities (also known as weights) are sorted.-Codes".
Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called "prefix-free codes") (that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol) that expresses the most common characters using shorter strings of bits than are used for less common source symbols. Huffman was able to design the most efficient compression method of this type: no other mapping of individual source symbols to unique strings of bits will produce a smaller average output size when the actual symbol frequencies agree with those used to create the code. A method was later found to do this in linear time if input probabilities (also known as weights) are sorted.
Platform: |
Size: 1024 |
Author: muhammad |
Hits:
Description: This archive contains a simple and readable ANSI C implementation of Huffman
coding and decoding.-This archive contains a simple and readable ANSI C implementation of Huffman
coding and decoding.
Platform: |
Size: 54272 |
Author: JP |
Hits:
«
1
2
3
4
5
6
78
9
10
11
12
...
50
»